Latent Log-Linear Models for Handwritten Digit Classification
نویسندگان
چکیده
منابع مشابه
Handwritten Digit Classification
The aim of this project was to evaluate the effectiveness of various types of classifiers in recognizing handwritten digits. It has been shown in pattern recognition that no single classifier performs the best for all pattern classification problems consistently. So the goal of the project was to experiment with different classifiers and combination methods and evaluate their performance in thi...
متن کاملUsing Generative Models for Handwritten Digit Recognition
We describe a method of recognizing handwritten digits by tting generative models that are built from deformable B-splines with Gaussian \ink generators" spaced along the length of the spline. The splines are adjusted using a novel elastic matching procedure based on the Expectation Maximization (EM) algorithm that maximizes the likelihood of the model generating the data. This approach has man...
متن کاملLearning Algorithms for Classification: a Comparison on Handwritten Digit Recognition
This paper compares the performance of several classi er algorithms on a standard database of handwritten digits. We consider not only raw accuracy, but also training time, recognition time, and memory requirements. When available, we report measurements of the fraction of patterns that must be rejected so that the remaining patterns have misclassi cation rates less than a given threshold.
متن کاملA modular classification scheme with elastic net models for handwritten digit recognition
This paper describes a modular class$cation system for handwritten digit recognition based on the elastic net model. We use ten separate elastic nets to capture different features in the ten classes of handwritten digits and represent an input sample from the activations in each net by population decoding. Compared with traditional neural networks based discriminant classifiers, our scheme feat...
متن کاملDecomposable Log-linear Models Decomposable Log-linear Models
The present paper considers discrete probability models with exact computational properties. In relation to contingency tables this means closed form expressions of the maksimum likelihood estimate and its distribution. The model class includes what is known as decomposable graphical models, which can be characterized by a structured set of conditional independencies between some variables give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2012
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2011.218